Invariant Signatures from Polygonal Approximations of Smooth Curves
نویسنده
چکیده
In this paper we propose to use invariant signatures of polygonal approximations of smooth curves for projective object recognition. Similar signatures have been proposed previously as simple and robust signatures. However, they were known to be sensitive to the curve sampling scheme and density, and worked well mainly for in-trinsically polygonal shapes. This paper proposes a re-sampling method for arbitrary polygonal approximations of smooth curves. The proposed re-sampling provides for weak-aane invariant parameterization and signature. Curve templates characterized by a scale space of these weak-aane invariant signatures together with a metric based on a modiied Dynamic Programming algorithm can accommodate projective invariant indexing.
منابع مشابه
Average curve of n smooth planar curves
We define the Average Curve (AC) of a compatible set of two or more smooth and planar, Jordan curves. It is independent of their order and representation. We compare two variants: the valley AC (vAC), defined in terms of the valley of the field that sums the squared distances to the input curves, and the zero AC (zAC), defined as the zero set of the field that sums the signed distances to the i...
متن کاملWidth invariant approximation of fuzzy numbers
In this paper, we consider the width invariant trapezoidal and triangularapproximations of fuzzy numbers. The presented methods avoid the effortful computation of Karush-Kuhn-Tucker Theorem. Some properties of the new approximation methods are presented and the applicability of the methods is illustrated by examples. In addition, we show that the proposed approximations of fuzzy numbers preserv...
متن کاملCompressed piecewise-circular approximations of 3D curves
We propose a compact approximation scheme for 3D curves. Consider a polygonal curve P, whose n vertices have been generated through adaptive (and nearly minimal) sampling, so that P approximates some original 3D curve, O, within tolerance 0. We present a practical and efficient algorithm for computing a continuous 3D curve C that approximates P within tolerance 1 and is composed of a chain of m...
متن کاملTechniques for Assessing Polygonal Approximations of Curves
Given the enormous number of available methods for finding polygonal approximations to curves techniques are required to assess different algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing an algorithm’s results relative to an optimal polygon, and describe a measure which combines the relat...
متن کاملPolygonal Invariant Curves for a Planar Piecewise Isometry
We investigate a remarkable new planar piecewise isometry whose generating map is a permutation of four cones. For this system we prove the coexistence of an infinite number of periodic components and an uncountable number of transitive components. The union of all periodic components is an invariant pentagon with unequal sides. Transitive components are invariant curves on which the dynamics a...
متن کامل